Maximum algebraic connectivity augmentation is NP-hard
نویسندگان
چکیده
منابع مشابه
Maximum algebraic connectivity augmentation is NP-hard
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a specified number of edges to an input graph to maximize the algebraic connectivity of the augmented graph is NP-hard.
متن کاملLocal edge-connectivity augmentation in hypergraphs is NP-complete
We consider a local edge-connectivity hypergraph augmentation problem. Specifically, we are given a hypergraph G = (V, E) and a subpartition of V . We are asked to find the smallest possible integer γ, for which there exists a set of size-two edges F , with |F | = γ, such that in G′ = (V,E ∪ F ), the local edge-connectivity between any pair of vertices lying in the same set in the subpartition ...
متن کاملLocal Connectivity Augmentation in Hypergraphs is NP-complete
We consider a local connectivity hypergraph augmentation problem. Specifically, we are given a hypergraph G = (V,E) and a subpartition of V . We are asked to find the smallest possible integer γ, for which there exists a set of size-two edges F , with |F |= γ, such that in G′ = (V,E ∪F), the local connectivity between any pair of vertices lying in the same set in the subpartition is at least a ...
متن کاملComputing the maximum matching width is NP-hard
The maximum matching width is a graph width parameter that is defined on a branchdecomposition over the vertex set of a graph. In this short paper, we prove that the problem of computing the maximum matching width is NP-hard.
متن کاملTrainyard is NP-hard
Recently, due to the widespread diffusion of smart-phones, mobile puzzle games have experienced a huge increase in their popularity. A successful puzzle has to be both captivating and challenging, and it has been suggested that this features are somehow related to their computational complexity [5]. Indeed, many puzzle games – such as Mah-Jongg, Sokoban, Candy Crush, and 2048, to name a few – a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2008
ISSN: 0167-6377
DOI: 10.1016/j.orl.2008.09.001